TSTP Solution File: ITP035^1 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : ITP035^1 : TPTP v8.2.0. Released v7.5.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n016.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Mon May 20 22:15:59 EDT 2024
% Result : Theorem 0.21s 0.54s
% Output : CNFRefutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 4
% Number of leaves : 7
% Syntax : Number of formulae : 14 ( 9 unt; 5 typ; 0 def)
% Number of atoms : 9 ( 8 equ; 0 cnn)
% Maximal formula atoms : 1 ( 1 avg)
% Number of connectives : 18 ( 3 ~; 0 |; 0 &; 15 @)
% ( 0 <=>; 0 =>; 0 <=; 0 <~>)
% Maximal formula depth : 2 ( 2 avg)
% Number of types : 1 ( 1 usr)
% Number of type conns : 4 ( 4 >; 0 *; 0 +; 0 <<)
% Number of symbols : 6 ( 4 usr; 3 con; 0-2 aty)
% Number of variables : 4 ( 1 ^ 3 !; 0 ?; 4 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_sort1,type,
complex: $tType ).
thf(decl_23,type,
deriv_complex: ( complex > complex ) > complex > complex ).
thf(decl_36,type,
id_complex: complex > complex ).
thf(decl_41,type,
one_one_complex: complex ).
thf(decl_87,type,
w: complex ).
thf(conj_0,conjecture,
( ( deriv_complex @ id_complex @ w )
= one_one_complex ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',conj_0) ).
thf(fact_3_deriv__id,axiom,
( ( deriv_complex @ id_complex )
= ( ^ [X3: complex] : one_one_complex ) ),
file('/export/starexec/sandbox2/benchmark/theBenchmark.p',fact_3_deriv__id) ).
thf(c_0_2,negated_conjecture,
( ( deriv_complex @ id_complex @ w )
!= one_one_complex ),
inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_0])]) ).
thf(c_0_3,plain,
! [X1261: complex] :
( ( deriv_complex @ id_complex @ X1261 )
= one_one_complex ),
inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_3_deriv__id])]) ).
thf(c_0_4,negated_conjecture,
( ( deriv_complex @ id_complex @ w )
!= one_one_complex ),
inference(fof_nnf,[status(thm)],[c_0_2]) ).
thf(c_0_5,plain,
! [X1293: complex] :
( ( deriv_complex @ id_complex @ X1293 )
= one_one_complex ),
inference(variable_rename,[status(thm)],[c_0_3]) ).
thf(c_0_6,negated_conjecture,
( ( deriv_complex @ id_complex @ w )
!= one_one_complex ),
inference(split_conjunct,[status(thm)],[c_0_4]) ).
thf(c_0_7,plain,
! [X2: complex] :
( ( deriv_complex @ id_complex @ X2 )
= one_one_complex ),
inference(split_conjunct,[status(thm)],[c_0_5]) ).
thf(c_0_8,negated_conjecture,
$false,
inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_6,c_0_7])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.07/0.12 % Problem : ITP035^1 : TPTP v8.2.0. Released v7.5.0.
% 0.07/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n016.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Sat May 18 17:51:38 EDT 2024
% 0.13/0.35 % CPUTime :
% 0.21/0.47 Running higher-order theorem proving
% 0.21/0.47 Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox2/benchmark/theBenchmark.p
% 0.21/0.54 # Version: 3.1.0-ho
% 0.21/0.54 # Preprocessing class: HSLSSMSMSSSNHSA.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.54 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.54 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.21/0.54 # Starting new_bool_1 with 300s (1) cores
% 0.21/0.54 # lpo9_lambda_fix with pid 13490 completed with status 0
% 0.21/0.54 # Result found by lpo9_lambda_fix
% 0.21/0.54 # Preprocessing class: HSLSSMSMSSSNHSA.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.54 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.54 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.21/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.54 # Search class: HGUSM-FSLM32-MHSFFSBN
% 0.21/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting lpo8_s with 163s (1) cores
% 0.21/0.54 # lpo8_s with pid 13493 completed with status 0
% 0.21/0.54 # Result found by lpo8_s
% 0.21/0.54 # Preprocessing class: HSLSSMSMSSSNHSA.
% 0.21/0.54 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.21/0.54 # Starting new_ho_10 with 1500s (5) cores
% 0.21/0.54 # Starting new_ho_10_cnf2 with 300s (1) cores
% 0.21/0.54 # Starting lpo9_lambda_fix with 300s (1) cores
% 0.21/0.54 # SinE strategy is gf500_gu_R04_F100_L20000
% 0.21/0.54 # Search class: HGUSM-FSLM32-MHSFFSBN
% 0.21/0.54 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.21/0.54 # Starting lpo8_s with 163s (1) cores
% 0.21/0.54 # Preprocessing time : 0.007 s
% 0.21/0.54 # Presaturation interreduction done
% 0.21/0.54
% 0.21/0.54 # Proof found!
% 0.21/0.54 # SZS status Theorem
% 0.21/0.54 # SZS output start CNFRefutation
% See solution above
% 0.21/0.54 # Parsed axioms : 433
% 0.21/0.54 # Removed by relevancy pruning/SinE : 118
% 0.21/0.54 # Initial clauses : 498
% 0.21/0.54 # Removed in clause preprocessing : 36
% 0.21/0.54 # Initial clauses in saturation : 462
% 0.21/0.54 # Processed clauses : 5
% 0.21/0.54 # ...of these trivial : 0
% 0.21/0.54 # ...subsumed : 0
% 0.21/0.54 # ...remaining for further processing : 5
% 0.21/0.54 # Other redundant clauses eliminated : 0
% 0.21/0.54 # Clauses deleted for lack of memory : 0
% 0.21/0.54 # Backward-subsumed : 0
% 0.21/0.54 # Backward-rewritten : 1
% 0.21/0.54 # Generated clauses : 0
% 0.21/0.54 # ...of the previous two non-redundant : 0
% 0.21/0.54 # ...aggressively subsumed : 0
% 0.21/0.54 # Contextual simplify-reflections : 0
% 0.21/0.54 # Paramodulations : 0
% 0.21/0.54 # Factorizations : 0
% 0.21/0.54 # NegExts : 0
% 0.21/0.54 # Equation resolutions : 0
% 0.21/0.54 # Disequality decompositions : 0
% 0.21/0.54 # Total rewrite steps : 1
% 0.21/0.54 # ...of those cached : 0
% 0.21/0.54 # Propositional unsat checks : 0
% 0.21/0.54 # Propositional check models : 0
% 0.21/0.54 # Propositional check unsatisfiable : 0
% 0.21/0.54 # Propositional clauses : 0
% 0.21/0.54 # Propositional clauses after purity: 0
% 0.21/0.54 # Propositional unsat core size : 0
% 0.21/0.54 # Propositional preprocessing time : 0.000
% 0.21/0.54 # Propositional encoding time : 0.000
% 0.21/0.54 # Propositional solver time : 0.000
% 0.21/0.54 # Success case prop preproc time : 0.000
% 0.21/0.54 # Success case prop encoding time : 0.000
% 0.21/0.54 # Success case prop solver time : 0.000
% 0.21/0.54 # Current number of processed clauses : 4
% 0.21/0.54 # Positive orientable unit clauses : 0
% 0.21/0.54 # Positive unorientable unit clauses: 1
% 0.21/0.54 # Negative unit clauses : 3
% 0.21/0.54 # Non-unit-clauses : 0
% 0.21/0.54 # Current number of unprocessed clauses: 457
% 0.21/0.54 # ...number of literals in the above : 1069
% 0.21/0.54 # Current number of archived formulas : 0
% 0.21/0.54 # Current number of archived clauses : 1
% 0.21/0.54 # Clause-clause subsumption calls (NU) : 0
% 0.21/0.54 # Rec. Clause-clause subsumption calls : 0
% 0.21/0.54 # Non-unit clause-clause subsumptions : 0
% 0.21/0.54 # Unit Clause-clause subsumption calls : 1
% 0.21/0.54 # Rewrite failures with RHS unbound : 0
% 0.21/0.54 # BW rewrite match attempts : 2
% 0.21/0.54 # BW rewrite match successes : 2
% 0.21/0.54 # Condensation attempts : 5
% 0.21/0.54 # Condensation successes : 0
% 0.21/0.54 # Termbank termtop insertions : 34351
% 0.21/0.54 # Search garbage collected termcells : 10084
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.035 s
% 0.21/0.54 # System time : 0.007 s
% 0.21/0.54 # Total time : 0.042 s
% 0.21/0.54 # Maximum resident set size: 4428 pages
% 0.21/0.54
% 0.21/0.54 # -------------------------------------------------
% 0.21/0.54 # User time : 0.047 s
% 0.21/0.54 # System time : 0.012 s
% 0.21/0.54 # Total time : 0.059 s
% 0.21/0.54 # Maximum resident set size: 2548 pages
% 0.21/0.54 % E---3.1 exiting
% 0.21/0.54 % E exiting
%------------------------------------------------------------------------------